Threshold changeable secret sharing schemes revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold changeable secret sharing schemes revisited

This paper studies the methods for changing thresholds in the absence of secure channels after the setup of threshold secret sharing schemes. First, we construct a perfect (t, n) threshold scheme that is threshold changeable to t ′ > t , which is optimal with respect to the share size. This improves the scheme of Wang and Wong by relaxing the requirement from q ≥ n + v to q > n with the secret-...

متن کامل

Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation

After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed ...

متن کامل

Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes

In a (r, n)-threshold secret sharing scheme, no group of (r − 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time. In order to deal with this issue, one may also require to have the ability to increase the threshold value from r to r′(> r), such an increment is likely to happen several times. In this paper, we study the problem o...

متن کامل

Repairable Threshold Secret Sharing Schemes

In this paper, we propose a class of new threshold secret sharing schemes with repairing function between shares. Specifically, each share, when it is broken or lost, can be repaired by some others without the help of the dealer. Further, a construction of such repairable threshold secret sharing schemes is designed by applying linearized polynomials and regenerating codes in distributed storag...

متن کامل

Verifiable Secret Redistribution for Threshold Sharing Schemes

We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m,n) access structures for threshold sharing schemes. Our protocol enables the addition or removal of shareholders and also guards against mobile adversaries that cause permanent damage. We observe that existing protocols either cannot be readily extended to allow redistribution between different access struct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2012

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2011.09.027